/*
 * @Date: 2021-09-08 09:15:34
 * @Author: Acckno1
 * @LastEditTime: 2021-09-08 09:20:20
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1010;

int n, m, k;
string arr[N];

inline void solution() {
    unordered_set<string> st;
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i ++ ) cin >> arr[i];

    vector<string> res;
    for (int i = k; i <= n; i += m ) {
        if (st.find(arr[i]) == st.end()) {
            res.push_back(arr[i]);
            st.insert(arr[i]);
        } else {
            while (st.find(arr[i]) != st.end()) i ++ ;
            res.push_back(arr[i]);
            st.insert(arr[i]);
        }
    }
    if (res.size()) {
        for (auto& s : res) cout << s << endl;
    } else cout << "Keep going..." << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}